Finite Derivation Type Property on the Chinese Monoid
نویسنده
چکیده
Squier introduced the notion finite derivation type which is a combinatorial condition satisfied by certain rewriting systems. The main result in this paper states that the Chinese monoid has finite derivation type property. Mathematics Subject Classification: 16S15; 20F05; 20F10; 20M50; 68Q42
منابع مشابه
A Polygraphic Survey on Finiteness Conditions for Rewriting Systems
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...
متن کاملPolygraphs of finite derivation type
Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he constructed finitely presentable monoids with a decidable word problem, but that cannot be presented by finite convergent rewriting systems. Later, he introduced the condition of finite derivation type, whic...
متن کاملHomological Finite Derivation Type
In 1987 Squier defined the notion of finite derivation type for a finitely presented monoid. To do this, he associated a 2-complex to the presentation. The monoid then has finite derivation type if, modulo the action of the free monoid ring, the 1-dimensional homotopy of this complex is finitely generated. Cremanns and Otto showed that finite derivation type implies the homological finiteness c...
متن کاملFinite Complete Rewriting Systems and Finite Derivation Type for Small Extensions of Monoids
Let S be a monoid and let T be a submonoid of nite index in S. The main results in this paper state that S can be presented by a nite complete rewriting system if T can, and S has nite derivation type if T has.
متن کاملA new finiteness condition for monoids presented by complete rewriting systems ( after Craig
Recently, Craig Squier introduced the notion of finite derivation type to show that some finitely presentable monoid has no presentation by means of a finite complete rewriting system. A similar result was already obtained by the same author using homology, but the new method is more direct and more powerful. Here, we present Squier’s argument with a bit of categorical machinery, making proofs ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010